Abstractive Meeting Summarization with Entailment and Fusion
نویسندگان
چکیده
ive Meeting Summarization with Entailment and Fusion Yashar Mehdad∗ Giuseppe Carenini∗ Frank W. Tompa∗∗ Department of Computer Science ∗University of British Columbia ∗∗University of Waterloo {mehdad, carenini}@cs.ubc.ca [email protected]
منابع مشابه
A Template-based Abstractive Meeting Summarization: Leveraging Summary and Source Text Relationships
In this paper, we present an automatic abstractive summarization system of meeting conversations. Our system extends a novel multi-sentence fusion algorithm in order to generate abstract templates. It also leverages the relationship between summaries and their source meeting transcripts to select the best templates for generating abstractive summaries of meetings. Our manual and automatic evalu...
متن کاملTowards Improving Abstractive Summarization via Entailment Generation
Abstractive summarization, the task of rewriting and compressing a document into a short summary, has achieved considerable success with neural sequence-tosequence models. However, these models can still benefit from stronger natural language inference skills, since a correct summary is logically entailed by the input document, i.e., it should not contain any contradictory or unrelated informat...
متن کاملAbstractive Meeting Summarization Using Dependency Graph Fusion
ive Meeting Summarization Using Dependency Graph Fusion Siddhartha Banerjee The Pennsylvania State University University Park PA, USA 16802 [email protected] Prasenjit Mitra Qatar Computing Research Institute Tornado Tower, 18th floor Doha, Qatar [email protected] Kazunari Sugiyama National University of Singapore 13 Computing Drive Singapore 117417 [email protected]
متن کاملFrom Extractive to Abstractive Meeting Summaries: Can It Be Done by Sentence Compression?
Most previous studies on meeting summarization have focused on extractive summarization. In this paper, we investigate if we can apply sentence compression to extractive summaries to generate abstractive summaries. We use different compression algorithms, including integer linear programming with an additional step of filler phrase detection, a noisychannel approach using Markovization formulat...
متن کاملAbstractive Meeting Summarization as a Markov Decision Process
ive Meeting Summarization as a Markov Decision Process
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013